منابع مشابه
Glycan Linkage Substitution Matrix Rooted on Tree Alignments
Glycans are chains of monosaccharides, known to be extremely vital for the development and functioning of multi-cellular organisms. Matching and alignment algorithms for glycans were introduced based on proven efficient methods in bioinformatics for protein sequences [2]. These algorithms consequently can be taken advantage of in the form of statistical analyses. These algorithms were designed ...
متن کاملApproximating the minmax rooted-tree cover in a tree
Given an edge-weighted rooted tree T and a positive integer p ( n), where n is the number of vertices in T , we cover all vertices in T by a set of p subtrees each of which contains the root r of T . The minmax rooted-tree cover problem asks to find such a set of p subtrees so as to minimize the maximum weight of the subtrees in the set. In this paper, we propose an O(n) time (2 + ε)-approximat...
متن کاملdeterminant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولA proof of the rooted tree alternative conjecture
In [2] Bonato and Tardif conjectured that the number of isomorphism classes of trees mutually embeddable with a given tree T is either 1 or ∞. We prove the analogue of their conjecture for rooted trees. We also discuss the original conjecture for locally finite trees and state some new conjectures.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2019
ISSN: 0024-3795
DOI: 10.1016/j.laa.2019.04.004